Українці та румуни: багатолітній досвід життя поруч

Рец. на кн.: Рендюк Т.Г. Українці в Румунії та румуни в Україні: проблеми минулого та сучасне становище. – К., 2011. – 293 с

Symbolic Automata: The Toolkit

Abstract. The symbolic automata toolkit lifts classical automata anal-ysis to work modulo rich alphabet theories. It uses the power of state-of-the-art constraint solvers for automata analysis that is both expres-sive and efficient, even for automata over large finite alphabets. The toolkit supports analysis of finite symbolic automata and transducers over strings. It also handles transducers with registers. Constraint solving is used when composing and minimizing automata, and a much deeper and powerful integration is also obtained by internalizing automata as theories. The toolkit, freely available from Microsoft Research1, has re-cently been used in the context of web security for analysis of potentially malicious data over Unicode characters. Introduction. The distinguishing feature of the toolkit is the use and oper-ations with symbolic labels. This is unlike classical automata algorithms that mostly work assuming a finite alphabet. Adtantages of a symbolic representa-tion are examined in [4], where it is shown that the symbolic algorithms con

Сучасна лексикографія як об’єкт лінгвістики

У статті проаналізовано сучасні праці теоретичної лексикографії, розглянуто погляди науковців на дефініцію терміна “лексикографія”.The article gives the analysis of contemporary works on theoretical lexicography and rewiews the approaches of different scientists to the term “lexicography”

Data parallel string manipulating programs

String-manipulating programs are an important class of programs with applications in malware detection, graphics, input sanitization for Web security, and large-scale HTML processing. This paper extends prior work on BEK, an expressive domain-specific language for writing string-manipulating programs, with algorithmic insights that make BEK both analyzable and data-parallel. By analyzable we mean that unlike most general purpose programming languages, many algebraic properties of a BEK program are decidable (i.e., one can check whether two programs commute or compute the inverse of a program). By data-parallel we mean that a BEK program can compute on arbitrary subsections of its input in parallel, thus exploiting parallel hardware. This latter requirement is particularly important for programs which operate on large data: without data parallelism, a programmer cannot hide the latency of reading data from various storage media (i.e., reading a terabyte of data from a modern hard drive takes about 3 hours). With a data-parallel approach, the system can split data across multiple disks and thus hide the latency of reading the data. A BEK program is expressive: a programmer can use conditionals, switch statements, and registers--or local variables--in order to implement common string-manipulating programs. Unfortunately, this expressivity induces data dependencies, which are an obstacle to parallelism. The key contribution of this paper is an algorithm which automatically removes these data dependencies by mapping a B EK program into a intermediate format consisting of symbolic transducers, which extend classical transducers with symbolic predicates and symbolic assignments. We present a novel algorithm that we call exploration which performs symbolic loop unrolling of these transducers to obtain simplified versions of the original program. We show how these simplified versions can then be lifted to a stateless form, and from there compiled to data-parallel hardware. To evaluate the efficacy of our approach, we demonstrate up to 8x speedups for a number of real-world, BEK programs, (e.g., HTML encoder and decoder) on data-parallel hardware. To the best of our knowledge, these are the first data parallel implementation of these programs. To validate that our approach is correct, we use an automatic testing technique to compare our generated code to the original implementations and find no semantic deviations

Модель похибки вимірювального трансформатора напруги

QC 20160524</p

Paraneoplastic pemphigus associated with post-transplant lymphoproliferative disorder after small bowel transplantation

Background PNP is a malignancy-associated autoimmune mucocutaneous syndrome due to autoantibodies against plakins, desmogleins, and other components of the epidermis and basement membrane of epithelial tissues. PNP-causing malignancies comprise mainly lymphoproliferative and hematologic neoplasms. PNP is extremely rare, especially in children. Methods Here, we present the first case of a child who developed PNP on a PTLD after small bowel transplantation because of a severe genetic protein-losing enteropathy. Results The patient in this case report had a severe stomatitis, striate palmoplantar keratoderma, and lichenoid skin lesions. In addition, she had marked esophageal involvement. She had lung pathology due to recurrent pulmonary infections and ventilator injury. Although we found no evidence of BO, she died from severe pneumonia and respiratory failure at the age of 12 years. Conclusion It is exceptional that, despite effective treatment of the PTLD, the girl survived 5 years after her diagnosis of PNP. We hypothesize that the girl survived relatively long after the PNP diagnosis due to strong T-cell suppressive treatments for her small bowel transplantation

Hepatitis C virus in hemophilia:Health-related quality of life after successful treatment in the sixth Hemophilia in the Netherlands study

INTRODUCTION: Persons with hemophilia and hepatitis C virus (HCV) infection have a lower health‐related quality of life (HRQoL) than those never HCV infected. However, it is unknown whether HRQoL after HCV eradication is comparable to individuals never HCV infected. We aimed to compare HRQoL between HCV‐cured and never chronically HCV‐infected persons with hemophilia. METHODS: All persons with hemophilia in the Netherlands were invited for a nationwide study conducted in 2018–2019. For the current analysis, participants born before 1992 with data on HRQoL and HCV status were included. HCV status was collected from medical records. HRQoL was measured by RAND‐36 questionnaire, with a minimally important difference set at 4.0 points. Multivariable linear regression was used to adjust for age, hemophilia severity, HIV status, and self‐reported joint impairment. RESULTS: In total, 486 persons were eligible; 180 were HCV cured and 306 never chronically HCV infected. Compared with those never HCV infected, HCV‐cured individuals were older (57 vs. 53 years), more often had severe hemophilia (67% vs. 21%), and reported more impaired joints (median 3 vs. 0). Compared with those never HCV infected, adjusted RAND‐36 domain scores of HCV‐cured individuals cured were lower on all RAND‐36 domains except Pain, ranging from a difference of 4.5 (95% CI, −8.8 to −0.3) for Physical functioning to 11.3 (95% CI, −19.4 to −3.1) for Role limitations due to physical problems. CONCLUSION: Despite effective HCV treatment, HRQoL of HCV‐cured persons with hemophilia is still lower than HRQoL of those never chronically HCV‐infected on all RAND‐36 domains. This implies that careful psychosocial follow‐up and support are indicated

Socioeconomic participation of persons with hemophilia:Results from the sixth hemophilia in the Netherlands study

Background and objectives Treatment availability and comprehensive care have resulted in improved clinical outcomes for persons with hemophilia. Recent data on socioeconomic participation in the Netherlands are lacking. This study assessed participation in education, in the labor market, and social participation for persons with hemophilia compared with the general male population. Methods Dutch adults and children (5-75 years) of all hemophilia severities (n = 1009) participated in a questionnaire study that included sociodemographic, occupational, and educational variables. Clinical characteristics were extracted from electronic medical records. General population data were extracted from Statistics Netherlands. Social participation was assessed with the PROMIS Ability to Participate in Social Roles and Activities short form, with a minimal important difference set at 1.0. Results Data from 906 adults and children were analyzed. Participation in education of 20 to 24 year olds was 68% (general male population: 53%). Educational attainment was higher compared with Dutch males, especially for severe hemophilia. Absenteeism from school was more common than in the general population. The employment-to-population ratio and occupational disability were worse for severe hemophilia than in the general population (64.3% vs. 73.2% and 14.7% vs. 4.8%, respectively), but similar for nonsevere hemophilia. Unemployment was 5.4% (general male population: 3.4%). Absenteeism from work was less common (38% vs. 45.2%). Mean PROMIS score was similar to or higher than in the general population (54.2; SD 8.9 vs. 50; SD 10). Conclusion Socioeconomic participation of persons with nonsevere hemophilia was similar to the general male population. Some participation outcomes for persons with severe hemophilia were reduced

Lightweight String Reasoning for OCL

International audienceModels play a key role in assuring software quality in the modeldriven approach. Precise models usually require the definition of OCL expressions to specify model constraints that cannot be expressed graphically. Techniques that check the satisfiability of such models and find corresponding instances of them are important in various activities, such as model-based testing and validation. Several tools to check model satisfiability have been developed but to our knowledge, none of them yet supports the analysis of OCL expressions including operations on Strings in general terms. As, in contrast, many industrial models do contain such operations, there is evidently a gap. There has been much research on formal reasoning on strings in general, but so far the results could not be included into model finding approaches. For model finding, string reasoning only contributes a sub-problem, therefore, a string reasoning approach for model finding should not add up front too much computational complexity to the global model finding problem. We present such a lightweight approach based on constraint satisfaction problems and constraint rewriting. Our approach efficiently solves several common kinds of string constraints and it is integrated into the EMFtoCSP model finder